Semidefinite Programming Approach to Gaussian Sequential Rate-Distortion Trade-Offs
نویسندگان
چکیده
منابع مشابه
The Time-Invariant Multidimensional Gaussian Sequential Rate-Distortion Problem Revisited
We revisit the sequential rate-distortion (SRD) trade-off problem for vector-valued Gauss-Markov sources with mean-squared error distortion constraints. We show via a counterexample that the dynamic reverse water-filling algorithm suggested by [1, eq. (15)] is not applicable to this problem, and consequently the closed form expression of the asymptotic SRD function derived in [1, eq. (17)] is n...
متن کاملLocal convergence for sequential semidefinite programming
We examine the local convergence of the sequential semidefinite programming algorithmfor solving optimization problems with nonlinear semidefinite constraints. The papers [1, 2]present a proof of local quadratic convergence of this algorithm under a strong assumption ofa second order sufficient optimality condition for a local minimizer. The present work extendslightly the a...
متن کاملTwo theoretical results for sequential semidefinite programming
We examine the local convergence of a sequential semidefinite programming approach for solving nonlinear programs with nonlinear semidefiniteness constraints. Known convergence results are extended to slightly weaker second order sufficient conditions and the resulting subproblems are shown to have local convexity properties that imply a weak form of self-concordance of the barrier subproblems.
متن کاملSupervised dimensionality reduction via sequential semidefinite programming
Many dimensionality reduction problems end up with a trace quotient formulation. Since it is difficult to directly solve the trace quotient problem, traditionally the trace quotient cost function is replaced by an approximation such that generalized eigenvalue decomposition can be applied. In contrast, we directly optimize the trace quotient in this work. It is reformulated as a quasi-linear se...
متن کاملRate-Distortion Performance of Sequential Massive Random Access to Gaussian Sources with Memory
In Sequential Massive Random Access (SMRA), a set of correlated sources is jointly encoded and stored on a server, and clients want to access to only a subset of the sources. Since the number of simultaneous clients can be huge, the server is only authorized to extract a bitstream from the stored data: no re-encoding can be performed before the transmission of a request. In this paper, we inves...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2017
ISSN: 0018-9286,1558-2523
DOI: 10.1109/tac.2016.2601148